Optimal Cache-Oblivious Mesh Layouts
نویسندگان
چکیده
منابع مشابه
Optimal Cache-Oblivious Mesh Layout
This paper shows how to generate a cache-oblivious memory layout of a well-shaped finite-element mesh G. This cache-oblivious mesh layout enables asymptotically optimal mesh updates, in which each vertex communicates with all of its neighbors. Mesh updates is the building block of iterative linear system solver. For block size B and cache size M, the mesh update cost is O(1+ |G|/B), assuming th...
متن کاملOptimal Cache-Oblivious Implicit Dictionaries
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this paper is that of closing the longstanding open problem about the existence of an optimal implicit dictionary over an unbounded universe. Another finding is motivated by the antithetic features of implicit and cache-obl...
متن کاملCache-oblivious Algorithms Cache-oblivious Algorithms Acknowledgments
This thesis presents “cache-oblivious” algorithms that use asymptotically optimal amounts of work, and move data asymptotically optimally among multiple levels of cache. An algorithm is cache oblivious if no program variables dependent on hardware configuration parameters, such as cache size and cache-line length need to be tuned to minimize the number of cache misses. We show that the ordinary...
متن کاملA Fast Cache Oblivious Mesh Layout with Theoretical Guarantees
One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cache-aware (CA) and cacheoblivious (CO) algorithms take into consideration the memory hierarchy to design cache efficient algorithms. CO approaches have the advantage to adapt to unknown and varying memory hierarchies. Recent CA and CO algorithms developed for 3D mesh layouts significan...
متن کاملOptimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees
We close an open issue on dictionaries dating back to the sixthies. An array of n keys can be sorted so that searching takes O(log n) time. Alternatively, it can be organized as a heap so that inserting and deleting keys take O(log n) time. We show that these bounds can be simultaneously achieved in the worst case for searching and updating by suitably maintaining a permutation of the n keys in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2009
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-009-9242-2